Universal traversal sequences for expander graphs
نویسندگان
چکیده
منابع مشابه
Universal Traversal Sequences for Expander Graphs
Graph reachability is a key problem in the study of various logarithmic space complexity classes. Its version for directed graphs is logspace complete for NSPACE(logn), and hence if proved to be in DSPACE(logn), the open question DSPACE(logn) = NSPACE(log n) will be settled. Seemingly the problem is easier for undirected graphs. In [1] it was shown to be in RLP (1-sided error, logspace, polynom...
متن کاملUniversal Traversal Sequences
In this article we discuss a purely combinatorial problem, the construction of short universal traversal sequences, and its relationship to questions about logspace computation. We state the problem formally, show how it arises naturally in complexity theory, and review some of the known partial results. A basic introduction to complexity theory can be found in 6]. The P vs. NP problem is recog...
متن کاملUniversal Traversal Sequences with Backtracking
In this paper we introduce a new notion of traversal sequences that we call exploration sequences. Exploration sequences share many properties with the traversal sequences defined in [AKL+], but they also exhibit some new properties. In particular, they have an ability to backtrack, and their random properties are robust under choice of the probability distribution on labels. Further, we presen...
متن کاملUniversal sequences for complete graphs
An n-labeled complete digraph G is a complete digraph with n + 1 vertices and n(n + 1) edges labeled { 1,2, . . . , n} such that there is a unique edge of each label emanating from each vertex. A sequence S in { 1,2, . . . , n} * and a starting vertex of G define a unique walk in G, in the obvious way. Suppose S is a sequence such that for each such G and each starting point in it, the correspo...
متن کاملUNIVERSAL TRAVERSAL SEQUENCES OF LENGTH noUogn) FOR CLIQUES
The reachability problem for graphs is a key problem in understanding the power of various logarithmic space complexity classes. For example, the reachability problem for directed graphs is logspace-complete for the complexity class NspAcE(log n) [5] and hence the open question DSPACE(log n) = NSPACE(log n) can be settled by answering whether this reachability problem belongs to DsPAcE(log n). ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1993
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90199-j